Custom Computing for Phylogenetics: Exploring the Solution Space for UPGMA

نویسندگان

  • Sreesa Akella
  • James P. Davis
چکیده

There is great interest in the use of custom computing machines (CCMs) to accelerate the performance of existing, highly optimized software algorithms in Bioinformatics. But, like many applications for CCMs in the sciences, there are many architecture and experimentation “data points” to be obtained before a solid understanding can be obtained as to the issues of migrating specialized scientific computing software applications to high-performance CCM platforms. This paper presents one such data point, namely, the design and comparative analysis of a custom computing application architecture for the UPGMA algorithm implemented on an FPGA-based platform. We present the UPGMA problem domain and explore design issues encountered in the transition from software algorithm executing on a standard PC platform to a hybrid custom compute “server” running a VLSI logic-based architecture for the algorithm. Using the low-cost Annapolis WildCard® platform, we discuss the CCM development method, and present an architecture created that takes into consideration the processing limitations of the platform. Given this implementation, we present results of experiments on system performance, as measured and compared against that of the benchmark UPGMA algorithm written in C, executing on a singleprocessor Pentium® PC.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probability Approach for Prediction of Pitting Corrosion Fatigue Life of Custom 450 Steel

In this study, the pitting type of corrosion growth characteristics, fatigue crack initiation and propagation behavior; axial fatigue tests were carried out on precipitation hardened martensitic Custom 450 steel in the air and 3.5wt% NaCl solution. Using the ratio of the depth to the half-width of the pits; (a/c)= 1.5±0.2 the corrosion pit depth growth law was obtained as a function of stress a...

متن کامل

An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR

In the computational biology and taxonomy, to construct phylogenetic tree is an important problem. A phylogenetic tree can represent the relationship and histories for a set of species and helpful for biologists to observe existent species. One of popular model is ultrametric tree, and it assumed the evolution rate is constant. UPGMA is one of well-known ultrametric tree algorithm. However, UPG...

متن کامل

Ultrametric Tree Construction and Evaluation Platform (UTCE) in Grid Computing System

-UTCE is a platform for ultrametric tree construction and tree evaluation. Phylogenetic tree can be used by biologists to observe the relationship between species, and the ultrametric tree is a popular model which is assumed that the rate of evolution is constant. UPGMA is one of well-know ultrametric tree constructing algorithm. However, UPGMA is a heuristic algorithm and can not guarantee the...

متن کامل

Polyhedral Combinatorics of UPGMA Cones

Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm. The partition lattice informs the study of UPGMA trees. We...

متن کامل

Study of Solute Dispersion with Source/Sink Impact in Semi-Infinite Porous Medium

Mathematical models for pollutant transport in semi-infinite aquifers are based on the advection-dispersion equation (ADE) and its variants. This study employs the ADE incorporating time-dependent dispersion and velocity and space-time dependent source and sink, expressed by one function. The dispersion theory allows mechanical dispersion to be directly proportional to seepage velocity. Initial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004